Multi-Level Orthogonal Hopping Rendezvous

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...

متن کامل

Efficient Channel-Hopping Rendezvous Algorithm Based on Available Channel Set

In cognitive radio networks, rendezvous is a fundamental operation by which two cognitive users establish a communication link on a commonly-available channel for communications. Some existing rendezvous algorithms can guarantee that rendezvous can be completed within finite time and they generate channel-hopping (CH) sequences based on the whole channel set. However, some channels may not be a...

متن کامل

Rendezvous in Highly-dynamic CRNs: A Frequency Hopping Approach

Establishing communications in a dynamic spectrum access (DSA) network requires communicating nodes to “rendezvous” before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. Current FH rendezvous designs have two main limitations. First, they do not account for fast primary user (PU) dynamics...

متن کامل

On Multi-Vehicle Rendezvous Under Quantized Communication

A rendezvous problem for a team of autonomous vehicles, which communicate over quantized channels, is analyzed. The paper illustrates how communication topologies based on uniform and logarithmic quantizations influence the performance. Since a logarithmic quantizer in general imposes fewer bits to be communicated compared to a uniform quantizer, the results indicate estimates of lower limits o...

متن کامل

Protocol visualization using LOTOS multi-rendezvous mechanism

In this paper, we propose a method for visualizing LOTOS speciications using multi-rendezvous mechanism. For visualization, we have extended LOTOS by introducing some primitive animation events. Using the extended LOTOS, we describe a visualization scenario for events which we would like to visualize their execution. Then, we execute the original speciication and its visualization scenario in p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2012

ISSN: 1089-7798

DOI: 10.1109/lcomm.2012.052112.120639